Scalable Distributed kNN Processing on Clustered Data Streams
نویسندگان
چکیده
منابع مشابه
Processing Distributed Compoud-Data Streams
In the environment of distribute data stream systems, the available communication bandwidth is a bottleneck resource. It is significant to reduce the communication overhead as possible for improving the availability of communication bandwidth with the constraint of the precision of queries. In this paper, we propose a new method for transferring data streams in distributed data stream systems, ...
متن کاملDistributed processing of Streams of Sensor Data
The recent technological advancements have enabled the development of low-cost, multifunctional and low-power sensor nodes. They are usually deployed into sensor networks serving a wide range of monitoring and data collection tasks. The majority of their applications depends heavily on the ability to extract useful data from the network. This is often achieved by running aggregates that produce...
متن کاملScalable, asynchronous, distributed eigen monitoring of astronomy data streams
Kanishka Bhaduri, Kamalika Das, Kirk Borne, Chris Giannella, Tushar Mahule, Hillol Kargupta Mission Critical Technologies Inc., NASA Ames Research Center, MS 269-1, Moffett Field, CA-94035 Email:[email protected] Stinger Ghaffarian Technologies Inc., NASA Ames Research Center, MS 269-3, Moffett Field, CA-94035 Email:[email protected] Computational and Data Sciences Dept., GMU, VA-...
متن کاملNIM: Scalable Distributed Stream Processing System on Mobile Network Data
As a typical example of New Moore’s law, the amount of 3G mobile broadband (MBB) data has grown from 15 to 20 times in the past two years (30TB to 40TB per day on average for a major city in China), real-time processing and mining of these data are becoming increasingly necessary. The overhead of storage and file transfer to HDFS, delay in processing, etc are making offline analysis on these da...
متن کاملLeeWave: level-wise distribution of wavelet coefficients for processing kNN queries over distributed streams
We present LEEWAVE − a bandwidth-efficient approach to searching range-specified k-nearest neighbors among distributed streams by LEvEl-wise distribution of WAVElet coefficients. To find the k most similar streams to a range-specified reference one, the relevant wavelet coefficients of the reference stream can be sent to the peer sites to compute the similarities. However, bandwidth can be unne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2931005